Straight-line programs: a practical test (extended abstract)
نویسندگان
چکیده
منابع مشابه
Indexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملPractical Analysis of Logic Programs with Delay ( Extended Abstract )
The paper focuses on practical analyses for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness.A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. A simple prototype implementation has been built a...
متن کاملFaster Sparse Interpolation of Straight-Line Programs
We give a new probabilistic algorithm for interpolating a “sparse” polynomial f given by a straight-line program. Our algorithm constructs an approximation f of f , such that f − f probably has at most half the number of terms of f , then recurses on the difference f−f. Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more ef...
متن کاملStraight-line Programs in Polynomial Equation Solving
Solving symbolically polynomial equation systems when intermediate and final polynomials are represented in the usual dense encoding turns out to be very inefficient: the sizes of the systems one can deal with do not respond to realistic needs. Evaluation representations appeared in this frame a decade ago as a new possibility to treat new families of problems. We present a survey of the most r...
متن کاملUnary Pushdown Automata and Straight-Line Programs
We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2013
ISSN: 1072-3374,1573-8795
DOI: 10.1007/s10958-013-1394-6